A Novel Association Rule Algorithm to Discover Maximal Frequent Item Set
نویسندگان
چکیده
Association Rule mining is a sub-discipline of data mining. Apriori algorithm is one of the most popular association rule mining technique. Apriori technique has a disadvantage that before generating a maximal frequent set it generates all possible proper subsets of maximal set. Therefore it is very slow as it requires many database scans before generating a maximal frequent itemset In the method proposed in this paper entire database is scanned only once. Frequency count of all distinct transactions is stored in a hash map. Algorithm maintains an array of tables such that each table in the array contain frequency count of all potential k-itemsets..Binary search and the concept of longest common subsequence are used to efficiently extract maximal frequent itemset. Experimental results show that proposed algorithm performs better than apriori algorithm.
منابع مشابه
Discovering Maximal Frequent Item set using Association Array and Depth First Search Procedure with Effective Pruning Mechanisms
The first step of association rule mining is finding out all frequent itemsets. Generation of reliable association rules are based on all frequent itemsets found in the first step. Obtaining all frequent itemsets in a large database leads the overall performance in the association rule mining. In this paper, an efficient method for discovering the maximal frequent itemsets is proposed. This met...
متن کاملDiscovery of Maximal Frequent Item Sets using Subset Creation
Data mining is the practice to search large amount of data to discover data patterns. Data mining uses mathematical algorithms to group the data and evaluate the future events. Association rule is a research area in the field of knowledge discovery. Many data mining researchers had improved upon the quality of association rule for business development by incorporating influential factors like u...
متن کاملA Novel Approach for finding Frequent Item Sets with Hybrid Strategies
Frequent item sets mining plays an important role in association rules mining. Over the years, a variety of algorithms for finding frequent item sets in very large transaction databases have been developed. Therefore, a number of methods have been proposed recently to discover approximate frequent item sets. This paper proposes an efficient SMine (Sorted Mine) Algorithm for finding frequent ite...
متن کاملAn Efficient Frequent Pattern Mining Algorithm to Find the Existence of K-Selective Interesting Patterns in Large Dataset Using SIFPMM
Association rule mining in huge database is one of most popular data exploration technique for business decision makers. Discovering frequent item set is the fundamental process in association rule mining. Several algorithms were introduced in the literature to find frequent patterns. Those algorithms discover all combinations of frequent item sets for a given minimum support threshold. But som...
متن کاملMax-Miner Algorithm Using Knowledge Discovery Process in Data Mining
Discovering frequent item sets is an important key problem in data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. Typical algorithms for solving this problem operate in a bottom-up, breadth-first search direction. The computation starts from frequent itemsets (the minimum length frequent itemsets) and continues until all maximal (lengt...
متن کامل